Application ot Active Dry Yeasts iii Technology ot Sparkling Wines.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource-Efficient OT Combiners with Active Security

An OT-combiner takes n candidate implementations of the oblivious transfer (OT) functionality, some of which may be faulty, and produces a secure instance of oblivious transfer as long as a large enough number of the candidates are secure. We see an OT-combiner as a 2-party protocol that can make several black-box calls to each of the n OT candidates, and we want to protect against an adversary...

متن کامل

ot eti

Last summer, AAAI sponsored a mobile robot competition in conjunction with the AAAI-92 conference in San Jose, California. Ten robots from across the country competed in the competition, with CARMEL from the University of Michigan finishing first. CARMEL is a Cybermotion K2A mobile platform with a ring of 24 sonar sensors and a single black and white CCD camera. For computing, CARMEL has three ...

متن کامل

Ot or Disibution

Skill learning and instrumental conditioning have a long association with the behaviorist research program and are often thought of in terms of rote learning of simple stimulus–response (S–R) associations based on external rewards. These forms of learning have also been strongly associated with the striatum of the basal ganglia, with different striatal regions apparently making various differen...

متن کامل

Multi-level OT

Since the early 1990s, Optimality Theory (OT) has quickly gained ground in phonology. Its main appeal lies in two characteristics: the focus on wellformedness of the output and the softness of constraints, where a constraint can be violated in order to satisfy more important requirements. A conspicuous characteristic of classic OT is that all constraints on the output should compete with each o...

متن کامل

Parsing in OT*

0. Abstract In this paper, I propose to implement syllabification in OT as a parser. I propose several innovations that result in a finite and small candidate set: i) MAX and DEP violations are not hypothesized by the parser, ii) candidates are encoded locally, and iii) EVAL is applied constraint by constraint. The parser is implemented in Prolog, and has a number of desirable consequences. Fir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kvasny Prumysl

سال: 1990

ISSN: 0023-5830

DOI: 10.18832/kp1990009